Computing the Zeros of Quaternion Polynomials

نویسنده

  • E. PEREIRA
چکیده

A method is developed to compute the zeros of a quaternion polynomial with all terms of the form ok Xk. This method is based essentially in Niven’s algorithm (11, which consists of dividing the polynomial by a characteristic polynomial associated to a zero. The information about the trace and the norm of the zero is obtained by an original idea which requires the companion matrix associated to the polynomial. The companion matrix is represented by a matrix with complex entries. Three numerical examples using Mathematics 2.2 version are given. @ 2001 Elsevier Science Ltd. All rights reserved. Keywords-Right (and left) quaternionic eigenvalues, Quaternionic polynomials, Companion quaternionic matrix.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some compact generalization of inequalities for polynomials with prescribed zeros

‎Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial‎ ‎of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$‎. ‎In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$‎, ‎$k^2 leq rRleq R^2$ and for $Rleq r leq k$‎. ‎Our results refine and generalize certain well-known polynomial inequalities‎.

متن کامل

Domain of attraction of normal law and zeros of random polynomials

Let$ P_{n}(x)= sum_{i=0}^{n} A_{i}x^{i}$ be a random algebraicpolynomial, where $A_{0},A_{1}, cdots $ is a sequence of independent random variables belong to the domain of attraction of the normal law. Thus $A_j$'s for $j=0,1cdots $ possesses the characteristic functions $exp {-frac{1}{2}t^{2}H_{j}(t)}$, where $H_j(t)$'s are complex slowlyvarying functions.Under the assumption that there exist ...

متن کامل

Explicit equivalence of quadratic forms over $\mathbb{F}_q(t)$

We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over Fq(t), where Fq is a finite field of odd characteristic. The algorithm is based on a suitable splitting of the form into two forms and finding a common value they both represent. We make use of an effective formula on the number of fixed degree irreducible polynomials ...

متن کامل

Using Chebyshev polynomial’s zeros as point grid for numerical solution of nonlinear PDEs by differential quadrature- based radial basis functions

Radial Basis Functions (RBFs) have been found to be widely successful for the interpolation of scattered data over the last several decades. The numerical solution of nonlinear Partial Differential Equations (PDEs) plays a prominent role in numerical weather forecasting, and many other areas of physics, engineering, and biology. In this paper, Differential Quadrature (DQ) method- based RBFs are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001